Syntactic transformation rules under P-Stable semantics: theory and implementation

We study the simplification of normal logic programs under the P-Stable semantics, with respect to the notions of equivalence, using many of the transformation rules found in literature in the context of Answer Set Programming (ASP). A schema for the implementation of P-Stable semantics is provided using two well known open source tools: Lparse and Minisat. Also, a prototype written in Java of a tool based on this schema is presented. We extend the work of Fernández [4] including a simplification routine in the post-parsing phase.